Greedy algorithm

Results: 236



#Item
101Information retrieval / Information / Computational linguistics / Precision and recall / Entity / Bin / N-gram / Science / Natural language processing / Information science

A Greedy Algorithm for Finding Sets of Entity Linking Interpretations in Queries Faegheh Hasibi Krisztian Balog

Add to Reading List

Source URL: web-ngram.research.microsoft.com

Language: English - Date: 2014-07-01 18:21:10
102Greedy algorithm / Matroid theory / Routing / Network topology / Topology / Routing algorithms / Network theory / Small world routing / Mathematics / Combinatorics / Network architecture

Increasing Network Resiliency by Optimally Assigning Diverse Variants to Routing Nodes

Add to Reading List

Source URL: www.cnds.jhu.edu

Language: English - Date: 2013-09-18 16:37:33
103Discrete mathematics / Matroid / Submodular set function / Greedy algorithm / Greedoid / Weighted matroid / Matroid theory / Mathematics / Combinatorics

Maximum Coverage over a Matroid Constraint Yuval Filmus Justin Ward University of Toronto China Theory Week 2011

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-10-18 11:48:40
104Mathematical optimization / Submodular set function / Operations research / Convex optimization / Matroid / Linear programming / Greedy algorithm / Algorithm / Greedoid / Mathematics / Matroid theory / Combinatorics

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus∗ and Justin Ward† December 30, 2013 Abstract

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2013-12-30 15:39:21
105Operations research / Linear programming / Combinatorial optimization / NP-complete problems / Greedy algorithm / Robot / Assignment problem / Algorithm / Set cover problem / Mathematics / Theoretical computer science / Applied mathematics

To appear in the Intl. J. of Robotics Research Also Technical Report CRES, Center for Robotics and Embedded Systems, USC, July 2003 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P.

Add to Reading List

Source URL: cres.usc.edu

Language: English - Date: 2004-06-08 10:49:29
106NP-complete problems / Matroid theory / Operations research / Submodular set function / Matroid / Greedy algorithm / Set cover problem / Linear programming / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-12-02 06:14:39
107Submodular set function / Order theory / Matroid / Linear programming / Greedy algorithm / XTR / Monotonic function / Greedoid / Ordinal optimization / Mathematics / Mathematical analysis / Matroid theory

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-11-25 12:04:59
108Factorial / Number theory / Greedy algorithm / Mathematics / Combinatorics / Discrete mathematics

Reactive Architecture Memo Scott Benson and Nils J. Nilsson February, 1994 1

Add to Reading List

Source URL: ai.stanford.edu

Language: English - Date: 2005-02-14 12:45:22
109Discrete geometry / Bin packing problem / Packaging / Heuristics / Packing problem / Search algorithm / Algorithm / Greedy algorithm / Mathematical optimization / Mathematics / Applied mathematics / Operations research

___________________________ Extreme Point-Based Heuristics for Three-Dimensional Bin Packing Teodor Gabriel Crainic Guido Perboli

Add to Reading List

Source URL: www.cirrelt.ca

Language: English - Date: 2007-10-23 14:47:14
110Greedy algorithm / Matroid theory / Routing / Topology / Connectivity / Network topology / Routing algorithms / Network theory / Small world routing / Mathematics / Combinatorics / Network architecture

1 Increasing Network Resiliency by Optimally Assigning Diverse Variants to Routing Nodes Andrew Newell1 , Daniel Obenshain2 , Thomas Tantillo2 , Cristina Nita-Rotaru1 , and Yair Amir2 1 Department of Computer Science, P

Add to Reading List

Source URL: www.cnds.jhu.edu

Language: English - Date: 2014-08-28 10:26:44
UPDATE